A simulation optimization method for vehicles dispatching among multiple container terminals
نویسندگان
چکیده
Container terminals, serving as the hubs between container ships and other transportations nodes, are of extreme importance in streamlining the ever increasing global trade. Many different factors affect the service efficiency in container terminals, which inspire great interest in both industrial and academic researches. This work focuses on vehicle dispatching problem which decides, for each internal vehicle in the port, where to go to find a new loading or unloading task in container terminals after finishing the previous one. A multi-factor online dispatching method, which takes both empty traveling and location balance into consideration, is proposed to fit the current condition of the physical and information infrastructure in most of the ports in mainland China. Such a method is established by using combined evolution searching function and discrete event simulation. Through comparing our dispatching method with the traditional dedicated vehicle dispatching methods in various simulation cases, together with theoretical analysis, we prove that our method delivers substantial efficiency improvement in terms of reducing ship serving time and vehicle empty traveling, regardless of changing environment we have examined in the study. 2014 Elsevier Ltd. All rights reserved.
منابع مشابه
Scheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملSimulation of Transportation Activities in Automated Seaport Container Terminals
A container terminal represents a complex system with highly dynamic interactions between the various handling, transportation and storage units and incomplete knowledge about future events. Hence, decentralized planning is the only realistic mode to govern logistics control of automated container terminals. We classify the specific logistics planning and control issues arising in seaport conta...
متن کاملDispatching Vehicles Considering Uncertain Handling times at Port Container Terminals
This paper considers the problem of vehicle dispatching at port container terminals in a dynamic environment. The problem deals with the assignment of delivery orders of containers to vehicles while taking into consideration the uncertainty in the travel times of the vehicles. Thus, a real-time vehicle dispatching algorithm is proposed for adaptation to the dynamic changes in the states of the ...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Expert Syst. Appl.
دوره 42 شماره
صفحات -
تاریخ انتشار 2015